Resolving decentralized identifiers using multiple resolvers

ABSTRACT

The resolving of a decentralized identifier to a corresponding data structure using multiple resolvers. This allows for the use of a consensus of resolvers to improve trust in the resolution process. In order to resolve, a decentralized identifier is sent to multiple resolvers. In response, each of at least some of those resolvers will return a data structure of a particular type (e.g., a decentralized identifier document) that is associated with the decentralized identifier. Then, it is determined whether the data structure for at least some number of resolvers matches each other. That is, it is determined whether at least some predetermined threshold of resolvers is returning the same data structure (e.g., the same decentralized identifier document). If so, then it is determined that the matching data structure is indeed associated with the decentralized identifier. Otherwise, the resolution process has failed.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.16/436,701 filed on Jun. 10, 2019, entitled “RESOLVING DECENTRALIZEDIDENTIFIERS USING MULTIPLE RESOLVERS,” which issued as U.S. Pat. No.11,394,718 on Jul. 19, 2022, and which application is expresslyincorporated herein by reference in its entirety.

BACKGROUND

Most currently used documents or records that prove identity are issuedby centralized organizations, such as governments, schools, employers,or other service centers or regulatory organizations. Theseorganizations often maintain every member's identity in a centralizedidentity management system. A centralized identity management system isa centralized information system used for organizations to manage theissued identities, their authentication, authorization, roles andprivileges. Centralized identity management systems have been deemed assecure since they often use professionally maintained hardware andsoftware. Typically, the identity issuing organization sets the termsand requirements for registering people with the organization. When aparty needs to verify another party's identity, the verifying partyoften needs to go through the centralized identity management system toobtain information verifying and/or authenticating the other party'sidentity.

Decentralized Identifiers (DIDs) are a new type of identifier, which areindependent from any centralized registry, identity provider, orcertificate authority. Distributed ledger technology (such asblockchain) provides the opportunity for using fully decentralizedidentifiers. Distributed ledger technology uses globally distributedledgers to record transactions between two or more parties in averifiable way. Once a transaction is recorded, the data in the sectionof ledger cannot be altered retroactively without the alteration of allsubsequent sections of ledger, which provides a fairly secure platform.Since a DID is generally not controlled by a centralized managementsystem but rather is owned by an owner of the DID, DIDs are sometimesreferred to as identities without authority.

The subject matter claimed herein is not limited to embodiments thatsolve any disadvantages or that operate only in environments such asthose described above. Rather, this background is only provided toillustrate one exemplary technology area where some embodiments describeherein may be practiced.

BRIEF SUMMARY

This Summary is provided to introduce a selection of concepts in asimplified form that are further described below in the DetailedDescription. This Summary is not intended to identify key features oressential features of the claimed subject matter, nor is it intended tobe used as an aid in determining the scope of the claimed subjectmatter.

Embodiments disclosed herein relate to the resolving of a decentralizedidentifier to a corresponding data structure using multiple resolvers.This allows for the use of a consensus of resolvers to improve trust inthe resolution process. In order to resolve, a decentralized identifieris sent to multiple resolvers. In response, each of at least some ofthose resolvers will return a data structure of a particular type (e.g.,a decentralized identifier document) that is associated with thedecentralized identifier.

Then, it is determined whether the data structure for at least somenumber of resolvers matches each other. That is, it is determinedwhether at least some predetermined threshold of resolvers is returningthe same data structure (e.g., the same decentralized identifierdocument). If so, then it is determined that the matching data structureis indeed associated with the decentralized identifier. Otherwise, theresolution process has failed.

Thus, a predetermined number (i.e., a consensus) of resolvers shouldreturn the same data structure (or at least a matching data structure)in order for the decentralized identifier to resolve properly. Thisconsensus number may depend on a level of resolver security. Thus, ifone or more resolvers have been injected improperly into the resolutionprocess, the multiple resolvers may fail to achieve consensus, and theresolution fails. Thus, there is improved security in resolvingdecentralized identifiers since resolution is achieved when there is anappropriate level of trust that the resolvers have not been compromisedor improperly injected into the resolution process.

Additional features and advantages will be set forth in the descriptionwhich follows, and in part will be obvious from the description, or maybe learned by the practice of the teachings herein. Features andadvantages of the invention may be realized and obtained by means of theinstruments and combinations particularly pointed out in the appendedclaims. Features of the present invention will become more fullyapparent from the following description and appended claims, or may belearned by the practice of the invention as set forth hereinafter.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and otheradvantages and features can be obtained, a more particular descriptionof the subject matter briefly described above will be rendered byreference to specific embodiments which are illustrated in the appendeddrawings. Understanding that these drawings depict only typicalembodiments and are not therefore to be considered to be limiting inscope, embodiments will be described and explained with additionalspecificity and details through the use of the accompanying drawings inwhich:

FIG. 1 illustrates an example computing system in which the principlesdescribed herein may be employed;

FIG. 2 illustrates an example environment for creating a decentralizedidentification (DID);

FIG. 3 illustrates an example environment for various DID managementoperations and services;

FIG. 4 illustrates an example decentralized storage device or identityhubs;

FIG. 5 illustrates an environment that includes multiple user agentsthat each are associated with a respective decentralized identifier, andthat use multiple resolvers to improve resolver security in accordancewith the principles described herein; and

FIG. 6 illustrates a flowchart of a method for resolving a decentralizedidentifier to obtain a data structure of a particular type and that isassociated with the decentralized identifier, in accordance with theprinciples described herein.

DETAILED DESCRIPTION

Embodiments disclosed herein relate to the resolving of a decentralizedidentifier to a corresponding data structure using multiple resolvers.This allows for the use of a consensus of resolvers to improve trust inthe resolution process. In order to resolve, a decentralized identifieris sent to multiple resolvers. In response, each of at least some ofthose resolvers will return a data structure of a particular type (e.g.,a decentralized identifier document) that is associated with thedecentralized identifier.

Then, it is determined whether the data structure for at least somenumber of resolvers matches each other. That is, it is determinedwhether at least some predetermined threshold of resolvers is returningthe same data structure (e.g., the same decentralized identifierdocument). If so, then it is determined that the matching data structureis indeed associated with the decentralized identifier. Otherwise, theresolution process has failed.

Thus, a predetermined number (i.e., a consensus) of resolvers shouldreturn the same data structure (or at least a matching data structure)in order for the decentralized identifier to resolve properly. Thisconsensus number may depend on a level of resolver security. Thus, ifone or more resolvers have been injected improperly into the resolutionprocess, the multiple resolvers may fail to achieve consensus, and theresolution fails. Thus, there is improved security in resolvingdecentralized identifiers since resolution is achieved when there is anappropriate level of trust that the resolvers have not been compromisedor improperly injected into the resolution process.

Because the principles described herein may be performed in the contextof a computing system, some introductory discussion of a computingsystem will be described with respect to FIG. 1. Then, this descriptionwill return to the principles of a decentralized identifier (DID)platform with respect to the remaining figures.

Computing systems are now increasingly taking a wide variety of forms.Computing systems may, for example, be handheld devices, appliances,laptop computers, desktop computers, mainframes, distributed computingsystems, data centers, or even devices that have not conventionally beenconsidered a computing system, such as wearables (e.g., glasses). Inthis description and in the claims, the term “computing system” isdefined broadly as including any device or system (or a combinationthereof) that includes at least one physical and tangible processor, anda physical and tangible memory capable of having thereoncomputer-executable instructions that may be executed by a processor.The memory may take any form and may depend on the nature and form ofthe computing system. A computing system may be distributed over anetwork environment and may include multiple constituent computingsystems.

As illustrated in FIG. 1, in its most basic configuration, a computingsystem 100 typically includes at least one hardware processing unit 102and memory 104. The processing unit 102 may include a general-purposeprocessor and may also include a field programmable gate array (FPGA),an application specific integrated circuit (ASIC), or any otherspecialized circuit. The memory 104 may be physical system memory, whichmay be volatile, non-volatile, or some combination of the two. The term“memory” may also be used herein to refer to non-volatile mass storagesuch as physical storage media. If the computing system is distributed,the processing, memory and/or storage capability may be distributed aswell.

The computing system 100 also has thereon multiple structures oftenreferred to as an “executable component”. For instance, the memory 104of the computing system 100 is illustrated as including executablecomponent 106. The term “executable component” is the name for astructure that is well understood to one of ordinary skill in the art inthe field of computing as being a structure that can be software,hardware, or a combination thereof. For instance, when implemented insoftware, one of ordinary skill in the art would understand that thestructure of an executable component may include software objects,routines, methods, and so forth, that may be executed on the computingsystem, whether such an executable component exists in the heap of acomputing system, or whether the executable component exists oncomputer-readable storage media.

In such a case, one of ordinary skill in the art will recognize that thestructure of the executable component exists on a computer-readablemedium such that, when interpreted by one or more processors of acomputing system (e.g., by a processor thread), the computing system iscaused to perform a function. Such structure may be computer readabledirectly by the processors (as is the case if the executable componentwere binary). Alternatively, the structure may be structured to beinterpretable and/or compiled (whether in a single stage or in multiplestages) so as to generate such binary that is directly interpretable bythe processors. Such an understanding of example structures of anexecutable component is well within the understanding of one of ordinaryskill in the art of computing when using the term “executablecomponent”.

The term “executable component” is also well understood by one ofordinary skill as including structures, such as hard coded or hard wiredlogic gates, which are implemented exclusively or near-exclusively inhardware, such as within a field programmable gate array (FPGA), anapplication specific integrated circuit (ASIC), or any other specializedcircuit. Accordingly, the term “executable component” is a term for astructure that is well understood by those of ordinary skill in the artof computing, whether implemented in software, hardware, or acombination. In this description, the terms “component”, “agent”,“manager”, “service”, “engine”, “module”, “virtual machine” or the likemay also be used. As used in this description and in the case, theseterms (whether expressed with or without a modifying clause) are alsointended to be synonymous with the term “executable component”, and thusalso have a structure that is well understood by those of ordinary skillin the art of computing.

In the description that follows, embodiments are described withreference to acts that are performed by one or more computing systems.If such acts are implemented in software, one or more processors (of theassociated computing system that performs the act) direct the operationof the computing system in response to having executedcomputer-executable instructions that constitute an executablecomponent. For example, such computer-executable instructions may beembodied on one or more computer-readable media that form a computerprogram product. An example of such an operation involves themanipulation of data. If such acts are implemented exclusively ornear-exclusively in hardware, such as within a FPGA or an ASIC, thecomputer-executable instructions may be hard-coded or hard-wired logicgates. The computer-executable instructions (and the manipulated data)may be stored in the memory 104 of the computing system 100. Computingsystem 100 may also contain communication channels 108 that allow thecomputing system 100 to communicate with other computing systems over,for example, network 110.

While not all computing systems require a user interface, in someembodiments, the computing system 100 includes a user interface system112 for use in interfacing with a user. The user interface system 112may include output mechanisms 112A as well as input mechanisms 112B. Theprinciples described herein are not limited to the precise outputmechanisms 112A or input mechanisms 112B as such will depend on thenature of the device. However, output mechanisms 112A might include, forinstance, speakers, displays, tactile output, virtual or augmentedreality, holograms and so forth. Examples of input mechanisms 112B mightinclude, for instance, microphones, touchscreens, virtual or augmentedreality, holograms, cameras, keyboards, mouse or other pointer input,sensors of any type, and so forth.

Embodiments described herein may comprise or utilize a special-purposeor general-purpose computing system including computer hardware, suchas, for example, one or more processors and system memory, as discussedin greater detail below. Embodiments described herein also includephysical and other computer-readable media for carrying or storingcomputer-executable instructions and/or data structures. Suchcomputer-readable media can be any available media that can be accessedby a general-purpose or special-purpose computing system.Computer-readable media that store computer-executable instructions arephysical storage media. Computer-readable media that carrycomputer-executable instructions are transmission media. Thus, by way ofexample, and not limitation, embodiments of the invention can compriseat least two distinctly different kinds of computer-readable media:storage media and transmission media.

Computer-readable storage media includes RAM, ROM, EEPROM, CD-ROM, orother optical disk storage, magnetic disk storage, or other magneticstorage devices, or any other physical and tangible storage medium whichcan be used to store desired program code means in the form ofcomputer-executable instructions or data structures and which can beaccessed by a general-purpose or special-purpose computing system.

A “network” is defined as one or more data links that enable thetransport of electronic data between computing systems and/or modulesand/or other electronic devices. When information is transferred orprovided over a network or another communications connection (eitherhardwired, wireless, or a combination of hardwired or wireless) to acomputing system, the computing system properly views the connection asa transmission medium. Transmission media can include a network and/ordata links which can be used to carry desired program code means in theform of computer-executable instructions or data structures and whichcan be accessed by a general-purpose or special-purpose computingsystem. Combinations of the above should also be included within thescope of computer-readable media.

Further, upon reaching various computing system components, program codemeans in the form of computer-executable instructions or data structurescan be transferred automatically from transmission media to storagemedia (or vice versa). For example, computer-executable instructions ordata structures received over a network or data link can be buffered inRAM within a network interface module (e.g., a “NIC”), and then beeventually transferred to computing system RAM and/or to less volatilestorage media at a computing system. Thus, it should be understood thatstorage media can be included in computing system components that also(or even primarily) utilize transmission media.

Computer-executable instructions comprise, for example, instructions anddata which, when executed at a processor, cause a general-purposecomputing system, special-purpose computing system, or special-purposeprocessing device to perform a certain function or group of functions.Alternatively, or in addition, the computer-executable instructions mayconfigure the computing system to perform a certain function or group offunctions. The computer executable instructions may be, for example,binaries or even instructions that undergo some translation (such ascompilation) before direct execution by the processors, such asintermediate format instructions such as assembly language, or evensource code.

Although the subject matter has been described in language specific tostructural features and/or methodological acts, it is to be understoodthat the subject matter defined in the appended claims is notnecessarily limited to the described features or acts described above.Rather, the described features and acts are disclosed as example formsof implementing the claims.

Those skilled in the art will appreciate that the invention may bepracticed in network computing environments with many types of computingsystem configurations, including, personal computers, desktop computers,laptop computers, message processors, hand-held devices, multi-processorsystems, microprocessor-based or programmable consumer electronics,network PCs, minicomputers, mainframe computers, mobile telephones,PDAs, pagers, routers, switches, datacenters, wearables (such asglasses) and the like. The invention may also be practiced indistributed system environments where local and remote computing system,which are linked (either by hardwired data links, wireless data links,or by a combination of hardwired and wireless data links) through anetwork, both perform tasks. In a distributed system environment,program modules may be located in both local and remote memory storagedevices.

Those skilled in the art will also appreciate that the invention may bepracticed in a cloud computing environment. Cloud computing environmentsmay be distributed, although this is not required. When distributed,cloud computing environments may be distributed internationally withinan organization and/or have components possessed across multipleorganizations. In this description and the following claims, “cloudcomputing” is defined as a model for enabling on-demand network accessto a shared pool of configurable computing resources (e.g., networks,servers, storage, applications, and services). The definition of “cloudcomputing” is not limited to any of the other numerous advantages thatcan be obtained from such a model when properly deployed.

The remaining figures may discuss various computing system which maycorrespond to the computing system 100 previously described. Thecomputing systems of the remaining figures include various components orfunctional blocks that may implement the various embodiments disclosedherein as will be explained. The various components or functional blocksmay be implemented on a local computing system or may be implemented ona distributed computing system that includes elements resident in thecloud or that implement aspects of cloud computing. The variouscomponents or functional blocks may be implemented as software,hardware, or a combination of software and hardware. The computingsystems of the remaining figures may include more or less than thecomponents illustrated in the figures and some of the components may becombined as circumstances warrant.

Some introductory discussion of a decentralized identifier (DID) and theenvironment in which they are created and reside will now be given withrespect to FIG. 2. As illustrated in FIG. 2, a DID owner 201 may own orcontrol a DID 205 that represents an identity of the DID owner 201. TheDID owner 201 may register a DID using a creation and registrationservice, which will be explained in more detail below.

The DID owner 201 may be any entity that could benefit from a DID. Forexample, the DID owner 201 may be a human being or an organization ofhuman beings. Such organizations might include a company, department,government, agency, or any other organization or group of organizations.Each individual human being might have a DID while the organization(s)to which each belongs might likewise have a DID.

The DID owner 201 may alternatively be a machine, system, or device, ora collection of machine(s), device(s) and/or system(s). In still otherembodiments, the DID owner 201 may be a subpart of a machine, system ordevice. For instance, a device could be a printed circuit board, wherethe subpart of that circuit board are individual components of thecircuit board. In such embodiments, the machine or device may have a DIDand each subpart may also have a DID. A DID owner might also be asoftware component such as the executable component 106 described abovewith respect to FIG. 1. An example of a complex executable component 106might be an artificial intelligence. Accordingly, an artificialintelligence may also own a DID.

Thus, the DID owner 201 may be any entity, human or non-human, which iscapable of creating the DID 205 or at least having the DID 205 createdfor and/or associated with them. Although the DID owner 201 is shown ashaving a single DID 205, this need not be the case as there may be anynumber of DIDs associated with the DID owner 201 as circumstanceswarrant.

As mentioned, the DID owner 201 may create and register the DID 205. TheDID 205 may be any identifier that may be associated with the DID owner201. Preferably, that identifier is unique to that DID owner 201, atleast within a scope in which the DID is anticipated to be in use. As anexample, the identifier may be a locally unique identifier, and perhapsmore desirably a globally unique identifier for identity systemsanticipated to operate globally. In some embodiments, the DID 205 may bea Uniform Resource identifier (URI) (such as a Uniform Resource Locator(URL)) or other pointer that relates the DID owner 201 to mechanisms toengage in trustable interactions with the DID owner 201.

The DID 205 is “decentralized” because it does not require acentralized, third-party management system for generation, management,or use. Accordingly, the DID 205 remains under the control of the DIDowner 201. This is different from conventional centralized IDs whichbase trust on centralized authorities and that remain under control ofcorporate directory services, certificate authorities, domain nameregistries, or other centralized authority (referred to collectively as“centralized authorities” herein). Accordingly, the DID 205 may be anyidentifier that is under the control of the DID owner 201 and that isindependent of any centralized authority.

In some embodiments, the structure of the DID 205 may be as simple as auser name or some other human-understandable term. However, in otherembodiments, for increased security, the DID 205 may preferably be arandom string of numbers and letters. In one embodiment, the DID 205 maybe a string of 128 numbers and letters. Accordingly, the embodimentsdisclosed herein are not dependent on any specific implementation of theDID 205. In a very simple example, the DID 205 is shown within thefigures as “123ABC”.

As also shown in FIG. 2, the DID owner 201 has control of a private key206 and public key 207 pair that is associated with the DID 205. Becausethe DID 205 is independent of any centralized authority, the private key206 should at all times be fully in control of the DID owner 201. Thatis, the private and public keys should be generated in a decentralizedmanner that ensures that they remain under the control of the DID owner201.

As will be described in more detail to follow, the private key 206 andpublic key 207 pair may be generated on a device controlled by the DIDowner 201. The private key 206 and public key 207 pair should not begenerated on a server controlled by any centralized authority as thismay cause the private key 206 and public key 207 pair to not be fullyunder the control of the DID owner 201 at all times. Although FIG. 2 andthis description have described a private and public key pair, it willalso be noted that other types of reasonable cryptographic informationand/or mechanisms may also be used as circumstances warrant.

FIG. 2 also illustrates a DID document 210 that is associated with theDID 205. As will be explained in more detail to follow, the DID document210 may be generated at the time that the DID 205 is created. In itssimplest form, the DID document 210 describes how to use the DID 205.Accordingly, the DID document 210 includes a reference to the DID 205,which is the DID that is described by the DID document 210. In someembodiments, the DID document 210 may be implemented according tomethods specified by a distributed ledger 220 (such as blockchain) thatwill be used to store a representation of the DID 205 as will beexplained in more detail to follow. Thus, the DID document 210 may havedifferent methods depending on the specific distributed ledger.

The DID document 210 also includes the public key 207 created by the DIDowner 201 or some other equivalent cryptographic information. The publickey 207 may be used by third party entities that are given permission bythe DID owner 201 to access information and data owned by the DID owner201. The public key 207 may also be used to verify that the DID owner201 in fact owns or controls the DID 205.

The DID document 210 may also include authentication information 211.The authentication information 211 may specify one or more mechanisms bywhich the DID owner 201 is able to prove that the DID owner 201 owns theDID 205. In other words, the mechanisms of the authenticationinformation 211 may show proof of a binding between the DID 205 (andthus its DID owner 201) and the DID document 210. In one embodiment, theauthentication information 211 may specify that the public key 207 beused in a signature operation to prove the ownership of the DID 205.Alternatively, or in addition, the authentication information 211 mayspecify that the public key 207 be used in a biometric operation toprove ownership of the DID 205. Accordingly, the authenticationinformation 211 may include any number of mechanisms by which the DIDowner 201 is able to prove that the DID owner 201 owns the DID 205.

The DID document 210 may also include authorization information 212. Theauthorization information 212 may allow the DID owner 201 to authorizethird party entities the rights to modify the DID document 210 or somepart of the document without giving the third party the right to proveownership of the DID 205. For example, the authorization information 212may allow the third party to update any designated set of one or morefields in the DID document 210 using any designated update mechanism.Alternatively, the authorization information may allow the third partyto limit the usages of DID 205 by the DID owner 201 for a specified timeperiod. This may be useful when the DID owner 201 is a minor child andthe third party is a parent or guardian of the child. The authorizationinformation 212 may allow the parent or guardian to limit use of the DIDowner 201 until such time as the child is no longer a minor.

The authorization information 212 may also specify one or moremechanisms that the third party will need to follow to prove they areauthorized to modify the DID document 210. In some embodiments, thesemechanisms may be similar to those discussed previously with respect tothe authentication information 211.

The DID document 210 may also include one or more service endpoints 213.A service endpoint may include a network address at which a serviceoperates on behalf of the DID owner 201. Examples of specific servicesinclude discovery services, social networks, file storage services suchas identity servers or hubs, and verifiable claim repository services.Accordingly, the service endpoints 213 operate as pointers for theservices that operate on behalf of the DID owner 201. These pointers maybe used by the DID owner 201 or by third party entities to access theservices that operate on behalf of the DID owner 201. Specific examplesof service endpoints 213 will be explained in more detail to follow.

The DID document 210 may further include identification information 214.The identification information 214 may include personally identifiableinformation such as the name, address, occupation, family members, age,hobbies, interests, or the like of DID owner 201. Accordingly, theidentification information 214 listed in the DID document 210 mayrepresent a different persona of the DID owner 201 for differentpurposes.

A persona may be pseudo anonymous. As an example, the DID owner 201 mayinclude a pen name in the DID document when identifying him or her as awriter posting articles on a blog. A persona may be fully anonymous. Asan example, the DID owner 201 may only want to disclose his or her jobtitle or other background data (e.g., a school teacher, an FBI agent, anadult older than 21 years old, etc.) but not his or her name in the DIDdocument. As yet another example, a persona may be specific to who theDID owner 201 is as an individual. As an example, the DID owner 201 mayinclude information identifying him or her as a volunteer for aparticular charity organization, an employee of a particularcorporation, an award winner of a particular award, and so forth.

The DID document 210 may also include credential information 215, whichmay also be referred to herein as an attestation. The credentialinformation 215 may be any information that is associated with the DIDowner 201's background. For instance, the credential information 215 maybe (but not limited to) a qualification, an achievement, a governmentID, a government right such as a passport or a driver's license, apayment provider or bank account, a university degree or othereducational history, employment status and history, or any otherinformation about the DID owner 201's background.

The DID document 210 may also include various other information 216. Insome embodiments, the other information 216 may include metadataspecifying when the DID document 210 was created and/or when it was lastmodified. In other embodiments, the other information 216 may includecryptographic proofs of the integrity of the DID document 210. In stillfurther embodiments, the other information 216 may include additionalinformation that is either specified by the specific method implementingthe DID document or desired by the DID owner 201.

FIG. 2 also illustrates a distributed ledger 220. The distributed ledger220 may be any decentralized, distributed network that includes variouscomputing systems that are in communication with each other. Forexample, the distributed ledger 220 may include a first distributedcomputing system 230, a second distributed computing system 240, a thirddistributed computing system 250, and any number of additionaldistributed computing systems as illustrated by the ellipses 260. Thedistributed ledger 220 may operate according to any known standards ormethods for distributed ledgers. Examples of conventional distributedledgers that may correspond to the distributed ledger 220 include, butare not limited to, Bitcoin [BTC], Ethereum, and Litecoin.

In the context of DID 205, the distributed ledger or blockchain 220 isused to store a representation of the DID 205 that points to the DIDdocument 210. In some embodiments, the DID document 210 may be stored onthe actual distributed ledger. Alternatively, in other embodiments theDID document 210 may be stored in a data storage (not illustrated) thatis associated with the distributed ledger 220.

As mentioned, a representation of the DID 205 is stored on eachdistributed computing system of the distributed ledger 220. For example,in FIG. 2 this is shown as DID hash 231, DID hash 241, and DID hash 251,which are ideally identical hashed copies of the same DID. The DID hash231, DID hash 241, and DID hash 251 may then point to the location ofthe DID document 210. The distributed ledger or blockchain 220 may alsostore numerous other representations of other DIDs as illustrated byreferences 232, 233, 234, 242, 243, 244, 252, 253, and 254.

In one embodiment, when the DID owner 201 creates the DID 205 and theassociated DID document 210, the DID hash 231, DID hash 241, and DIDhash 251 are written to the distributed ledger 220. The distributedledger 220 thus records that the DID 205 now exists. Since thedistributed ledger 220 is decentralized, the DID 205 is not under thecontrol of any entity outside of the DID owner 201. DID hash 231, DIDhash 241, and DID hash 251 may each include, in addition to the pointerto the DID document 210, a record or time stamp that specifies when theDID 205 was created. At a later date, when modifications are made to theDID document 210, each modification (and potentially also a timestamp ofthe modification) may also be recorded in DID hash 231, DID hash 241,and DID hash 251. DID hash 231, DID hash 241, and DID hash 251 mayfurther include a copy of the public key 207 so that the DID 205 iscryptographically bound to the DID document 210.

Having described DIDs and how they operate generally with reference toFIG. 2, specific embodiments of DID environments will now be explained.Turning to FIG. 3, an environment 300 that may be used to performvarious DID management operations and services will now be explained. Itwill be appreciated that the environment of FIG. 3 may referenceelements from FIG. 2 as needed for ease of explanation.

As shown in FIG. 3, the environment 300 may include various devices andcomputing systems that may be owned or otherwise under the control ofthe DID owner 201. These may include a user device 301. The user device301 may be, but is not limited to, a mobile device such as a smartphone, a computing device such as a laptop computer, or any device suchas a car or an appliance that includes computing abilities. The device301 may include a web browser 302 operating on the device and anoperating system 303 operating the device. More broadly speaking, thedashed line 304 represents that all of these devices may be owned orotherwise under the control of the DID owner 201.

The environment 300 also includes a DID management module 320. It willbe noted that in operation, the DID management module 320 may reside onand be executed by one or more of user device 301, web browser 302, andthe operating system 303 as illustrated by respective lines 301 a, 302a, and 303 a. Accordingly, the DID management module 320 is shown asbeing separate for ease of explanation. The DID management module 320may be also described as a “wallet” in that it can hold various claimsrelated to a particular DID.

As shown in FIG. 3, the DID management module 320 includes a DIDcreation module 330. The DID creation module 330 may be used by the DIDowner 201 to create the DID 205 or any number of additional DIDs, suchas DID 331. In one embodiment, the DID creation module may include orotherwise have access to a User Interface (UI) element 335 that mayguide the DID owner 201 in creating the DID 205. The DID creation module330 may have one or more drivers that are configured to work withspecific distributed ledgers such as distributed ledger 220 so that theDID 205 complies with the underlying methods of that distributed ledger.

A specific embodiment will now be described. For example, the UI 335 mayprovide a prompt for the user to enter a user name or some other humanrecognizable name. This name may be used as a display name for the DID205 that will be generated. As previously described, the DID 205 may bea long string of random numbers and letters and so having ahuman-recognizable name for a display name may be advantageous. The DIDcreation module 330 may then generate the DID 205. In the embodimentshaving the UI 335, the DID 205 may be shown in a listing of identitiesand may be associated with the human-recognizable name.

The DID creation module 330 may also include a key generation module350. The key generation module may generate the private key 206 andpublic key 207 pair previously described. The DID creation module 330may then use the DID 205 and the private and public key pair to generatethe DID document 210.

In operation, the DID creation module 330 accesses a registrar 310 thatis configured to the specific distributed ledger that will be recordingthe transactions related to the DID 205. The DID creation module 330uses the registrar 310 to record DID hash 231, DID hash 241, and DIDhash 251 in the distributed ledger in the manner previously described,and to store the DID document 210 in the manner previously described.This process may use the public key 207 in the hash generation.

In some embodiments, the DID management module 320 may include anownership module 340. The ownership module 340 may provide mechanismsthat ensure that the DID owner 201 is in sole control of the DID 205. Inthis way, the provider of the DID management module 320 is able toensure that the provider does not control the DID 205, but is onlyproviding the management services.

As previously discussed, the key generation module 350 generates theprivate key 206 and public key 207 pair and the public key 207 is thenrecorded in the DID document 210. Accordingly, the public key 207 may beused by all devices associated with the DID owner 201 and all thirdparties that desire to provide services to the DID owner 201.Accordingly, when the DID owner 201 desires to associate a new devicewith the DID 205, the DID owner 201 may execute the DID creation module330 on the new device. The DID creation module 330 may then use theregistrar 310 to update the DID document 210 to reflect that the newdevice is now associated with the DID 205, which update would bereflected in a transaction on the distributed ledger 220, as previouslydescribed.

In some embodiments, however, it may be advantageous to have a publickey per device 301 owned by the DID owner 201 as this may allow the DIDowner 201 to sign with the device-specific public key without having toaccess a general public key. In other words, since the DID owner 201will use different devices at different times (for example using amobile phone in one instance and then using a laptop computer in anotherinstance), it is advantageous to have a key associated with each deviceto provide efficiencies in signing using the keys. Accordingly, in suchembodiments the key generation module 350 may generate additional publickeys 208 and 209 when the additional devices execute the DID creationmodule 330. These additional public keys may be associated with theprivate key 206 or in some instances may be paired with a new privatekey.

In those embodiments where the additional public keys 208 and 209 areassociated with different devices, the additional public keys 208 and209 may be recorded in the DID document 210 as being associated withthose devices. This is shown in FIG. 3. It will be appreciated that theDID document 210 may include the information (information 205, 207 and211 through 216) previously described in relation to FIG. 2 in additionto the information (information 208, 209 and 365) shown in FIG. 3. Ifthe DID document 210 existed prior to the device-specific public keysbeing generated, then the DID document 210 would be updated by thecreation module 330 via the registrar 310 and this would be reflected inan updated transaction on the distributed ledger 220.

In some embodiments, the DID owner 201 may desire to keep secret theassociation of a device with a public key or the association of a devicewith the DID 205. Accordingly, the DID creation module 330 may causethat such data be secretly shown in the DID document 210.

As described thus far, the DID 205 has been associated with all thedevices under the control of the DID owner 201, even when the deviceshave their own public keys. However, in some embodiments it may beuseful for each device or some subset of devices under the control ofthe DID owner 201 to each have their own DID. Thus, in some embodimentsthe DID creation module 330 may generate an additional DID, for exampleDID 331, for each device. The DID creation module 330 would thengenerate private and public key pairs and DID documents for each of thedevices and have them recorded on the distributed ledger 220 in themanner previously described. Such embodiments may be advantageous fordevices that may change ownership as it may be possible to associate thedevice-specific DID to the new owner of the device by granting the newowner authorization rights in the DID document and revoking such rightsfrom the old owner.

As mentioned, to ensure that the private key 206 is totally in thecontrol of the DID owner 201, the private key 206 is created on the userdevice 301, browser 302, or operating system 303 that is owned orcontrolled by the DID owner 201 that executed the DID management module320. In this way, there is little chance that a third party (and mostconsequentially, the provider of the DID management module 320) may gaincontrol of the private key 206.

However, there is a chance that the device storing the private key 206may be lost by the DID owner 201, which may cause the DID owner 201 tolose access to the DID 205. Accordingly, in some embodiments, the UI 335may include the option to allow the DID owner 201 to export the privatekey 206 to an off device secured database 305 that is under the controlof the DID owner 201. As an example, the database 305 may be one of theidentity hubs 410 described below with respect to FIG. 4. A storagemodule 380 is configured to store data (such as the private key 206 orattestations made by or about the DID owner 201) off device in thedatabase 305 or identity hubs 410. In some embodiments, the private key206 may be stored as a QR code that may be scanned by the DID owner 201.

In other embodiments, the DID management module 320 may include arecovery module 360 that may be used to recover a lost private key 206.In operation, the recovery module 360 allows the DID owner 201 to selectone or more recovery mechanisms 365 at the time the DID 205 is createdthat may later be used to recover the lost private key. In thoseembodiments having the UI 335, the UI 335 may allow the DID owner 201 toprovide information that will be used by the one or more recoverymechanisms 365 during recovery. The recovery module 360 may then be runon any device associated with the DID 205.

The DID management module 320 may also include a revocation module 370that is used to revoke or sever a device from the DID 205. In operation,the revocation module may use the UI element 335, which may allow theDID owner 201 to indicate a desire to remove a device from beingassociated with the DID 205. In one embodiment, the revocation module370 may access the DID document 210 and may cause that all references tothe device be removed from the DID document 210. Alternatively, thepublic key for the device may be removed. This change in the DIDdocument 210 may then be reflected as an updated transaction on thedistributed ledger 220 as previously described.

FIG. 4 illustrates an embodiment of an environment 400 in which a DIDsuch as DID 205 may be utilized. Specifically, the environment 400 willbe used to describe the use of the DID 205 in relation to one or moredecentralized stores or identity hubs 410 that are each under thecontrol of the DID owner 201 to store data belonging to or regarding theDID owner 201. For instance, data may be stored within the identity hubsusing the storage module 380 of FIG. 3. It will be noted that FIG. 4 mayinclude references to elements first discussed in relation to FIG. 2 or3 and thus use the same reference numeral for ease of explanation.

In one embodiment, the identity hubs 410 may be multiple instances ofthe same identity hub. This is represented by the line 410A. Thus, thevarious identity hubs 410 may include at least some of the same data andservices. Accordingly, if a change is made to part of at least some ofthe data (and potentially any part of any of the data) in one of theidentity hubs 410, the change may be reflected in one or more of (andperhaps all of) the remaining identity hubs.

The identity hubs 410 may be any data store that may be in the exclusivecontrol of the DID owner 201. As an example only, the first identity hub411 and second identity hub 412 are implemented in cloud storage(perhaps within the same cloud, or even on different clouds managed bydifferent cloud providers) and thus may be able to hold a large amountof data. Accordingly, a full set of the data may be stored in theseidentity hubs.

However, the identity hubs 413 and 414 may have less memory space.Accordingly, in these identity hubs a descriptor of the data stored inthe first and second identity hubs may be included. Alternatively, arecord of changes made to the data in other identity hubs may beincluded. Thus, changes in one of the identity hubs 410 are either fullyreplicated in the other identity hubs or at least a record or descriptorof that data is recorded in the other identity hubs.

Because the identity hubs may be multiple instances of the same identityhub, only a full description of the first identity hub 411 will beprovided as this description may also apply to the identity hubs 412through 414. As illustrated, identity hub 411 may include data storage420. The data storage 420 may be used to store any type of data that isassociated with the DID owner 201. In one embodiment the data may be acollection 422 of a specific type of data corresponding to a specificprotocol. For example, the collection 422 may be medical records datathat corresponds to a specific protocol for medical data. The collection422 may include any other type of data, such as attestations made by orabout the DID owner 201.

In one embodiment, the stored data may have different authentication andprivacy settings 421 associated with the stored data. For example, afirst subset of the data may have a setting 421 that allows the data tobe publicly exposed, but that does not include any authentication to theDID owner 201. This type of data may be for relatively unimportant datasuch as color schemes and the like. A second subset of the data may havea setting 421 that allows the data to be publicly exposed and thatincludes authentication to the DID owner 201. A third subset of the datamay have a setting 421 that encrypts the subset of data with the privatekey 206 and public key 207 pair (or some other key pair) associated withthe DID owner 201. This type of data will require a party to have accessto the public key 207 (or to some other associated public key) in orderto decrypt the data. This process may also include authentication to theDID owner 201. A fourth subset of the data may have a setting 421 thatrestricts this data to a subset of third parties. This may require thatpublic keys associated with the subset of third parties be used todecrypt the data. For example, the DID owner 201 may cause the setting421 to specify that only public keys associated with friends of the DIDowner 201 may decrypt this data. With respect to data stored by thestorage module 380, these settings 411 may be at least partiallycomposed by the storage module 380 of FIG. 3.

In some embodiments, the identity hub 411 may have a permissions module430 that allows the DID owner 201 to set specific authorization orpermissions for third parties such as third parties 401 and 402 toaccess the identity hub. For example, the DID owner 201 may provideaccess permission to his or her spouse to all the data 420.Alternatively, the DID owner 201 may allow access to his or her doctorfor any medical records. It will be appreciated that the DID owner 201may give permission to any number of third parties to access a subset ofthe data 420. This will be explained in more detail to follow. Withrespect to data stored by the storage module 380, these accesspermissions 430 may be at least partially composed by the storage module380 of FIG. 3.

The identity hub 411 may also have a messaging module 440. In operation,the messaging module allows the identity hub to receive messages such asrequests from parties such as third parties 401 and 402 to access thedata and services of the identity hub. In addition, the messaging module440 allows the identity hub 411 to respond to the messages from thethird parties and to also communicate with a DID resolver 450. This willbe explained in more detail to follow. The ellipsis 416 represents thatthe identity hub 411 may have additional services as circumstanceswarrant.

In one embodiment, the DID owner 201 may wish to authenticate a newdevice 301 with the identity hub 411 that is already associated with theDID 205 in the manner previously described. Accordingly, the DID owner201 may utilize the DID management module 320 associated with the newuser device 301 to send a message to the identity hub 411 asserting thatthe new user device is associated with the DID 205 of the DID owner 201.

However, the identity hub 411 may not initially recognize the new deviceas being owned by the DID owner 201. Accordingly, the identity hub 411may use the messaging module 440 to contact the DID resolver 450. Themessage sent to the DID resolver 450 may include the DID 205.

The DID resolver 450 may be a service, application, or module that isconfigured in operation to search the distributed ledger 220 for DIDdocuments associated with DIDs. Accordingly, in the embodiment the DIDresolver 450 may search the distributed ledger 220 using the DID 205,which may result in the DID resolver 450 finding the DID document 210.The DID document 210 may then be provided to the identity hub 411.

As discussed previously, the DID document 210 may include a public key208 or 209 that is associated with the new user device 301. To verifythat the new user device is owned by the DID owner 201, the identity hub411 may provide a cryptographic challenge to the new user device 301using the messaging module 440. This cryptographic challenge will bestructured such that only a device having access to the private key 206will be able to successfully answer the challenge.

In this embodiment, since the new user device is owned by DID owner 201and thus has access to the private key 206, the challenge may besuccessfully answered. The identity hub 411 may then record in thepermissions 430 that the new user device 301 is able to access the dataand services of the identity hub 411 and also the rest of the identityhubs 410.

It will be noted that this process of authenticating the new user device301 was performed without the need for the DID owner 201 to provide anyusername, password or the like to the provider of the identity hub 411(i.e., the first cloud storage provider) before the identity hub 411could be accessed. Rather, the access was determined in a decentralizedmanner based on the DID 205, the DID document 210, and the associatedpublic and private keys. Since these were at all times in the control ofthe DID owner 201, the provider of the identity hub 411 was not involvedand thus has no knowledge of the transaction or of any personalinformation of the DID owner 201.

In another example embodiment, the DID owner 201 may provide the DID 205to the third-party entity 401 so that the third party may access data orservices stored on the identity hub 411. For example, the DID owner 201may be a human who is at a scientific conference who desires to allowthe third party 401, who is also a human, access to his or her researchdata. Accordingly, the DID owner 201 may provide the DID 205 to thethird party 401.

Once the third party 401 has access to the DID 205, he or she may accessthe DID resolver 450 to access the DID document 210. As previouslydiscussed, the DID document 210 may include an end point 213 that is anaddress or pointer to services associated with the decentralizedidentity.

Completing the research data example, the third party 401 may send amessage to the messaging module 440 asking for permission to access theresearch data. The messaging module 440 may then send a message to theDID owner 201 asking if the third party 401 should be given access tothe research data. Because the DID owner desires to provide access tothis data, the DID owner 201 may allow permission to the third party 401and this permission may be recorded in the permissions 430.

The messaging module 440 may then message the third party 401 informingthe third party that he or she is able to access the research data. Theidentity hub 411 and the third party 401 may then directly communicateso that the third party may access the data. It will be noted that inmany cases, it will actually be an identity hub associated with thethird party 401 that communicates with the identity hub 411. However, itmay be a device of the third party 401 that does the communication.

Advantageously, the above-described process allows the identity hub 411and the third party 401 to communicate and to share the data without theneed for the third party to access the identity hub 411 in theconventional manner. Rather, the communication is provisioned in thedecentralized manner using the DID 205 and the DID document 210. Thisadvantageously allows the DID owner to be in full control of theprocess.

As shown in FIG. 4, the third party 402 may also request permission foraccess to the identity hub 411 using the DID 205 and the DID document210. Accordingly, the embodiments disclosed herein allow access to anynumber of third parties to the identity hubs 410.

FIG. 5 illustrates an environment 500 that includes multiple user agents501 that each are associated with a respective decentralized identifier.For instance, the user agents 501 are illustrated as including threeuser agents 501A, 501B and 501C. The ellipsis 501D represents that theenvironment 500 may include any number of user agents. For instance, theenvironment 500 may include as few as a single user agent. On the otherextreme, the environment 500 may include an innumerable number of useragents. Each user agent may be, for example, an instance of the DIDmanagement module 320 of FIG. 3.

Each of the user agents 501 is associated with a respectivedecentralized identifier 502. In the illustrated example in which thereare three user agents, the user agent 501A is associated withdecentralized identifier 502A (or decentralized identifier “A”) asrepresented by the line 503A. Furthermore, the user agent 501B isassociated with decentralized identifier 502B (or decentralizedidentifier “B) as represented by the line 503B. Finally, the user agent501C is associated with the decentralized identifier 502C (ordecentralized identifier “C”) as represented by the line 503C.

In accordance with the principles described herein, each of one or moreuser agents uses a consensus of resolvers to resolve their respectivedecentralized identifier. The environment 500 thus also includesmultiple resolvers 510. For instance, the resolvers 510 are illustratedas including seven resolvers 511 through 517 (illustrated symbolicallyas circles in FIG. 5). However, the ellipsis 518 is illustrated torepresent that the environment 500 may include any number of resolvers.An example of a resolver is the DID resolver 450 of FIG. 4.

Each user agent 501A, 501B and 501C uses multiple of the resolvers 510in order to obtain a data structure of a particular type (e.g., a DIDdocument) using the respective decentralized identifier A, B and C. Forinstance, the resolvers may be used to obtain data structures (e.g.,respective DID documents) associated with the decentralized identifierfrom a distributed ledger 520. As an example, the user agent 501A mightuse some or all of the resolvers (e.g., resolvers 511 through 515) inorder to obtain the data structure 521A associated with thedecentralized identity A, the user agent 501B might use some or all ofthe resolvers (e.g., resolvers 513 through 515) in order to obtain thedata structure 521B associated with the decentralized identity B, andthe user agent 501C might user some or all of the resolvers (e.g.,resolvers 513 through 517) in order to obtain the data structure 521Cassociated with the decentralized identity C. Thus, although notrequired, the set of used to resolve each or some or all of thedecentralized identifiers 502 may be different.

FIG. 6 illustrates a flowchart of a method 600 for resolving adecentralized identifier to obtain a data structure of a particular typeand that is associated with the decentralized identifier. Such a datastructure will also be referred to hereinafter as a DID document. Theresolution of the centralized identifier involves the resolver obtainingthe data structure from a distributed ledger. As an example, any of theuser agents 501 in the environment 500 of FIG. 5 may perform the method600 to resolve their respective decentralized identifier 502 usingmultiple of the resolvers 510. Hereinafter, in what is referred to asthe “subject example”, the user agent 501A uses the resolvers 511through 515 in order to obtain a DID document 521A associated with therespective decentralized identifier A. Accordingly, the method 600 willnow be described with frequent reference to the environment 500 of FIG.5 and the subject example.

The method 600 includes identifying a level of resolver security (act601). In addition. As an example, the identification of the level ofresolver security may be based on user-input by a user that owns thedecentralized identifier. For instance, the user might explicitly statethe number of resolvers to be used to resolve their decentralizedidentity into a corresponding data structure (e.g., their DID document)as well as how many or what proportion of those resolvers must match intheir returned data structure in order to achieve appropriate consensusthat the returned data structure is indeed correct. In any case, thenumber of resolvers that should return a matching data structure may bepredetermined based on the determined level of resolver security (act602).

In order to perform the resolution, the user agent sends the centralizedidentifier to the multiple resolvers (act 611). In the subject example,the user agent 501A sends the decentralized identity A to each of themultiple resolvers 511 through 515, as represented by respective arrows531 through 535. Each of the resolvers may then resolve thedecentralized identifier A into a corresponding DID document (e.g., datastructure 521A), which is then returned, as represented by respectivearrows 541 through 545. The resolvers need not be aware that they areother resolver that are performing resolution of the decentralizedidentifier into the corresponding DID document.

In response to sending the decentralized identifier (e.g., decentralizedidentifier A in the subject example), the user agent receives a datastructure of a particular type from each of at least some of themultiple resolvers that were sent the decentralized identifier (act612). For instance, in the subject example, perhaps all of the resolvers511 through 515 returns a DID document for the decentralized identity Ato the user agent 501A for that decentralized identifier A. However, itmight also be that less than all (e.g., perhaps only resolvers 511, 512and 514) returns a corresponding DID document. Some or all of thereturned DID documents will match. That will presumably be the case ifthere are not resolvers that are malfunctioning or worse yet, resolversthat have intentionally been inserted into the set of availableresolvers 510 in order to maliciously return a false DID document.

The user agent will then determine how many of the returned datastructures are a match (act 613). This may involve determining that thereturned data structure match exactly, or that the returned datastructures match as to certain core content and/or characteristics. Notethat the determination of the level of resolver security (act 601) andthe determination of the predetermined number of resolvers that shouldreturn a matching data structure (act 602) is shown in parallel with thesending of the decentralized identifier to multiple resolvers (act 611),the receiving of the corresponding matching data structure (act 612),and the determining of the number of returned matching data structures(act 613).

This is merely to reflect that the principles described herein are notdependent on when the determination of the level of resolver security(act 601) occurs. The determination of the level of resolver security(act 601) might be performed well in advance of the remainder of themethod 600. In fact, perhaps the determination of the level of resolversecurity (act 601) may be determined only once for multiple instances ofthe other portions (acts 611 through 616) of the method 600.Alternatively, the level of resolver security (act 601) may be performedeach time the remainder (acts 611 through 616) of the method 600 isperformed. That is, the level of resolver security may be adjustablebetween resolutions of the decentralized identifier.

The user agent then determines whether the matching data structure(e.g., the matching DID document) is associated with the decentralizedidentifier based on the number of resolvers that provided the matchingDID document. If the number of resolvers meets or exceeds a thresholdnumber (“Yes” in decision block 614), the user agent determines that thematching data structure (e.g., the matching DID document) is associatedwith the decentralized identifier (act 615). On the other hand, if thenumber of resolvers is less than the threshold number (“No” in decisionblock 614). The user agent determines that the matching data structure(e.g., the matching DID document) is not associated with thedecentralized identifier (act 616).

As an example, perhaps the level of resolver security is very high, andall of the multiple resolvers must return a matching data structure inorder for the returned data structure to be affirmatively determined asassociated with the decentralized identifier. In the subject example,this would mean that the user agent 501A would require all of the datastructures returned by the resolvers 511 through 515 to be matching inorder to determine that the returned data structure is validlyassociated with the decentralized identity A.

At a slightly lower level of resolver security, perhaps the user agent501A will allow for one exception such that one of the resolvers 511through 515 may return a non-matching data structure (i.e., a datastructure that does not match the data structures returned by the otherresolvers). That one exception may be ignored. A resolver that fails toreturn a data structure at all may also be deemed to be an exception.Thus, in this case, the user agent 501A would determine that thematching data structure is associated with the decentralized identity A.

At an even lower level of resolver security, perhaps the user agent 501Awill accept a matching data structure as being associated with thedecentralized identity A so long as a majority (e.g., three in thesubject example) of the resolvers 511 through 515 return a datastructure that matches each other. For instance, perhaps resolvers 511,513, and 514 returns a matching data structure, but resolvers 512 and515 either fail to return any data structure, or return a data structurethat does not match the data structure that was returned by theresolvers 511, 513 and 514.

At an even lower level of resolver security, perhaps the user agent 501Awill accept a matching data structure as being associated with thedecentralized identity A so long as multiple (even less than a majority)of the resolvers 511 through 515 returns a data structure that matcheseach other.

The method 600 may be performed multiple times for any given user agent.For instance, the method 600 may be performed multiple times for useragent 501A, each time the user agent 501A resolves the decentralizedidentifier A into its appropriate data structure (e.g., DID document)521A. Although, as previously mentioned, the level of resolver securityneed not be defined or adjusted (act 601) each time the decentralizedidentifier A is resolved.

Likewise, the method 600 may be performed multiple times for user agent501B each time the user agent 501B resolves the decentralized identifierB. Although not required, the level of resolver security (and also thepredetermined number of resolvers that should return a matching datastructure) for resolving the decentralized identifier B may be differentthan the level of resolver security for resolving the decentralizedidentifier A. The method 600 may be performed multiple times for useragent 501C each time the user agent 501C resolves the decentralizedidentifier C. Although not required, the level of resolver security (andthe predetermined number of resolvers that should return a matching datastructure) for resolving the decentralized identifier C may be differentthan the level of resolver security for resolving the decentralizedidentifier A and/or B.

FIG. 5 shows that all of the resolves resolve data structures from asingle distributed ledger. It is preferred that a single data structurebe stored on a distributed ledger. However, the broadest principlesdescribed herein permit resolving from different distributed ledgers fordata structures associated with different decentralized identities. Forinstance, data structure 521A may be on the distributed ledger 520, butperhaps the data structures 521B and 521C are on a different distributedledger.

Thus, the principles described herein permit for the defining of apredetermined number (i.e., a consensus) of resolvers that should returnthe same data structure (or at least a matching data structure) in orderfor the decentralized identifier to resolve properly. This consensusnumber may depend on a level of resolver security. Thus, if one or moreresolvers have been injected improperly into the resolution process, themultiple resolvers may fail to achieve consensus, and the resolutionfails. Thus, there is improved security in resolving decentralizedidentifiers since resolution is achieved when there is an appropriatelevel of trust that the resolvers have not been compromised orimproperly injected into the resolution process.

For the processes and methods disclosed herein, the operations performedin the processes and methods may be implemented in differing order.Furthermore, the outlined operations are only provided as examples, andsome of the operations may be optional, combined into fewer steps andoperations, supplemented with further operations, or expanded intoadditional operations without detracting from the essence of thedisclosed embodiments.

The present invention may be embodied in other specific forms withoutdeparting from its spirit or characteristics. The described embodimentsare to be considered in all respects only as illustrative and notrestrictive. The scope of the invention is, therefore, indicate by theappended claims rather than by the foregoing description. All changeswhich come within the meaning and range of equivalency of the claims areto be embraced within their scope.

What is claimed is:
 1. A computing system comprising: one or moreprocessors; and one or more computer-readable media having thereoncomputer-executable instructions that are structured such that areexecutable by the one or more processors for configuring the computingsystem to perform a method for resolving a decentralized identifier toobtain a data structure of a particular type and that is associated withthe decentralized identifier, the method comprising: identifying a levelof resolver security associated with a consensus requirement; sending adecentralized identifier to a plurality of resolvers; receiving datastructures from the plurality of resolvers, including at least amatching data structure of a particular type from each of at least someof the plurality of resolvers, in response to sending the decentralizedidentifier; determining a proportion of the received data structuresthat comprise the matching data structure; and determining that thematching data structure is associated with the decentralized identifierwhen the proportion of the received data structures meets or exceeds theconsensus requirement, or else determining that the matching datastructure is not associated with the decentralized identifier when theproportion of the received data structures fails to meet the consensusrequirement.
 2. The computing system in accordance with claim 1, theidentification of the level of security being based on user-input by auser that owns the decentralized identifier.
 3. The computing system inaccordance with claim 2, the user input further specifying a number ofresolvers that the decentralized identifier is to be sent to.
 4. Thecomputing system in accordance with claim 2, the user input specifying aproportion of resolvers that must provide matching data structures toresolve the decentralized identifier.
 5. The computing system inaccordance with claim 1, wherein the plurality of resolvers are each fora single distributed ledger which holds the data structure of theparticular type and that is associated with the decentralizedidentifier.
 6. The computing system in accordance with claim 1, theselectable level of resolver security being adjustable between differentresolutions of the decentralized identifier.
 7. The computing system inaccordance with claim 1, wherein the selectable level of resolversecurity is different for each of a plurality of different decentralizedidentifiers.
 8. A method for resolving a decentralized identifier toobtain a data structure of a particular type and that is associated withthe decentralized identifier, the method comprising: identifying adesignated level of resolver security, based on user input, from aplurality of different levels of resolver security, each level ofresolver security being associated with a different threshold ofmatching data structures; sending a decentralized identifier to aplurality of resolvers; receiving a matching data structure of aparticular type from each of at least some of the plurality of resolversin response to sending the decentralized identifier; resolving thedecentralized identifier when it is determined a sufficient quantity ofmatching data structures have been received from the plurality ofresolvers to resolve the decentralized identifier based on whether thematching structures received satisfy the threshold of matching datastructures associated with the designated level of resolver security;and enabling an entity request in response to resolving thedecentralized identifier.
 9. The method of claim 8, wherein the entityrequest is a request to authorize modification of a data structureassociated with the decentralized identifier.
 10. The method of claim 8,wherein the entity request is a request to verify a user.
 11. The methodof claim 8, wherein the entity request is a request to access dataassociated with the decentralized identifier.
 12. The method inaccordance with claim 8, the decentralized identifier being a firstdecentralized identifier, the level of resolver security being forresolving the first decentralized identifier, the plurality of resolversbeing a first plurality of resolvers, the matching data structure beinga first matching data structure, the method further comprising:identifying a second level of resolver security for resolving the seconddecentralized identifier, the second level of resolver security beingassociated with a different quantity of matching data structures;sending the second decentralized identifier to a second plurality ofresolvers; receiving a second matching data structure of the particulartype from each of at least some of the second plurality of resolvers inresponse to sending the second decentralized identifier; and determiningthe second matching data structure is associated with the seconddecentralized identifier when it is determined the different quantity ofmatching data structures have been received from the second plurality ofresolvers.
 13. The method in accordance with claim 12, the firstplurality of resolvers being a least partially different than the secondplurality of resolvers.
 14. The method in accordance with claim 12, thequantity of matching data structures being different than the secondquantity of matching data structures.
 15. The method in accordance withclaim 12, the selectable first level of resolver security beingadjustable between resolutions of the first decentralized identifier andthe selectable second level of resolver security being adjustablebetween resolutions of the second decentralized identifier.
 16. Themethod in accordance with claim 12, wherein the first plurality ofresolvers are the same as the second plurality of resolvers.
 17. Themethod in accordance with claim 12, wherein the first plurality ofresolvers are each for resolving for a single distributed ledger whichholds the data structures of the particular type.
 18. The method inaccordance with claim 17, wherein the second plurality of resolvers areeach for resolving for the single distributed ledger.
 19. The method inaccordance with claim 17, the single distributed ledger being a firstdistributed ledger, wherein the second plurality of resolvers are eachfor resolving for a second single distributed ledger.
 20. A computerprogram product comprising one or more computer-readable storage mediahaving thereon computer-executable instructions that executable by oneor more processors of a computing system for configuring the computingsystem to perform a method for resolving a decentralized identifier toobtain a data structure of a particular type and that is associated withthe decentralized identifier, the method comprising: identifying adesignated level of resolver security, based on user input, from aplurality of different levels of resolver security, each level ofresolver security being associated with a different threshold ofmatching data structures; sending a decentralized identifier to aplurality of resolvers; receiving a matching data structure of aparticular type from each of at least some of the plurality of resolversin response to sending the decentralized identifier; resolving thedecentralized identifier when it is determined a sufficient quantity ofmatching data structures have been received from the plurality ofresolvers to resolve the decentralized identifier based on whether thematching structures received satisfy the threshold of matching datastructures associated with the designated level of resolver security;and enabling an entity request in response to resolving thedecentralized identifier.